/*
Some MS Questions
Given 2 set of arrays of size N(sorted +ve integers ) 
find the median of the resultant array of size 2N.
(dont even think of sorting the two arrays in a third array ,
though u can sort them. 
Try something better than order NLogN )

Given two arrays of numbers,
find if each of the two arrays have the same set of integers ? 
Suggest an algo which can run faster than NlogN without extra space?

Given a string, search it in a set of strings (say among 1000s of string). What data structure would you use to store those 1000 strings and get the results fastest? 

http://discuss.joelonsoftware.com/default.asp?interview.11.572362.24

*/

#include "junix.h"

int main(){
}
